Discrete logarithm - PDFSEARCH.IO - Document Search Engine

Discrete logarithm
Results: 130

#	Item
51	LNCSWhy Textbook ElGamal and RSA Encryption Are Insecure Add to Reading List Source URL: www.ssi.gouv.fr Language: English - Date: 2009-11-10 09:37:20 Finite fields Electronic commerce Cryptography RSA XTR ElGamal encryption Discrete logarithm Abstract algebra Public-key cryptography Mathematics
52	Some experiments investigating a possible L(1/4) algorithm for the discrete logarithm problem in algebraic curves Maike Massierer∗ LORIA, Campus Scientifique, BP 239, 54506 Vandœuvre-l`es-Nancy Cedex, France maike.mas Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-13 07:45:36 Polynomials Computer algebra Integer factorization algorithms Group theory General number field sieve Factorization of polynomials Logarithm Finite field Index calculus algorithm Abstract algebra Mathematics Algebra
53	Chapter 10 Number-Theoretic Primitives Number theory is a source of several computational problems that serve as primitives in the design of cryptographic schemes. Asymmetric cryptography in particular relies on these pr Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2009-09-20 23:35:30 Group theory Finite fields Computational hardness assumptions Logarithms Discrete logarithm Diffie–Hellman problem Baby-step giant-step Elliptic curve Diffie–Hellman key exchange Abstract algebra Cryptography Mathematics
54	Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders Safuat Hamdy Bodo Möller Add to Reading List Source URL: www.bmoeller.de Language: English - Date: 2006-01-02 00:23:19 Integer factorization algorithms Finite fields Computational hardness assumptions Algebraic number theory Group theory XTR Discrete logarithm Quadratic sieve Integer factorization Abstract algebra Mathematics Algebra
55	The Statistical Zero-knowledge Proof for Blum Integer Based on Discrete Logarithm∗ Chunming Tang † Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2003-11-03 03:50:58 Integer sequences Modular arithmetic Quadratic residue Zero-knowledge proof Blum integer Non-interactive zero-knowledge proof Proof of knowledge NP IP Cryptography Mathematics Cryptographic protocols
56	Efficient Implementation of Genus Three Hyperelliptic Curve Cryptography over F2n Izuru Kitamura and Masanobu Katagi Sony Corporation, Kitashinagawa Shinagawa-ku, Tokyo, Japan {Izuru.Kitamura, Masanobu.Ka Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2003-11-28 08:21:17 Group theory Algebraic curves Hyperelliptic curve cryptography Public-key cryptography Hyperelliptic curve Elliptic curve XTR Discrete logarithm RAR Abstract algebra Finite fields Cryptography
57	Two novel applications of bilinear groups to ABE encryption Riccardo Longo Department of Mathematics, University of Trento, Italy Chiara Marcolla Department of Mathema Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-12 11:38:03 Finite fields Cryptographic protocols Diffie–Hellman problem Pairing-based cryptography Hellman Diffie–Hellman key exchange Discrete logarithm Whitfield Diffie BLS Cryptography Abstract algebra Computational hardness assumptions
58	CS255: Cryptography and Computer Security Winter 2003 Basic number theory fact sheet Part II: Arithmetic modulo composites Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2004-01-05 17:05:09 Modular arithmetic Public-key cryptography Finite fields Integer factorization algorithms RSA Prime number Euclidean algorithm Discrete logarithm Coprime Abstract algebra Mathematics Cryptography
59	CS255: Cryptography and Computer Security Winter 2002 Basic number theory fact sheet Part II: Arithmetic modulo composites Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2002-02-27 14:09:32 Modular arithmetic Public-key cryptography Finite fields Integer factorization algorithms RSA Prime number Euclidean algorithm Discrete logarithm Coprime Abstract algebra Mathematics Cryptography
60	Cryptography and Computer Security CS255 Basic number theory fact sheet Part II: Arithmetic modulo composites Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2005-02-22 19:09:43 Modular arithmetic Public-key cryptography Finite fields Integer factorization algorithms RSA Euclidean algorithm Prime number Discrete logarithm Chinese remainder theorem Abstract algebra Mathematics Cryptography